RankCut - A Domain Independent Forward Pruning Method for Games
نویسندگان
چکیده
Forward pruning, also known as selective search, is now employed in many strong game-playing programs. In this paper, we introduce RankCut – a domain independent forward pruning technique which makes use of move ordering, and prunes once no better move is likely to be available. Since gameplaying programs already perform move ordering to improve the performance of αβ search, this information is available at no extra cost. As RankCut uses additional information untapped by current forward pruning techniques, RankCut is a complementary forward pruning method that can be used with existing methods, and is able to achieve improvements even when conventional pruning techniques are simultaneously employed. We implemented RankCut in a modern open-source chess program, CRAFTY. RankCut reduces the game-tree size by approximately 10%-40% for search depths 8-12 while retaining tactical reliability, when implemented alongside CRAFTY’s existing forward pruning techniques.
منابع مشابه
Forward Estimation for Game-Tree Search
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very simple method to estimate bounds on the minimax values of interior nodes of a game tree, and use the bounds to improve minimax search. The new algorithm, called forward estimation, does not require additional domain k...
متن کاملToward an Analysis of Forward Pruning
Sever0,1 early game-playing computer programs used forward pruning (i.e., the practice of deliberately ignoring nodes that are believed unlikely to affect a game tree’s minimax value), but this technique did not seem to result in good decisionmaking. The poor performance of forward pruning presents a major puzzle for AI research on game playing, because some version of forward pruning seems to ...
متن کاملAn Analysis of Forward Pruning
Several early game-playing computer programs used forward pruning (i.e., the practice of deliberately ignoring nodes that are believed unlikely to affect a game tree’s minimax value), but this technique did not seem to result in good decision-making. The poor performance of forward pruning presents a major puzzle for AI research on game playing, because some version of forward pruning seems to ...
متن کاملTree Pruning for New Search Techniques in Computer Games
This paper proposes a new mechanism for pruning a search game-tree in computer chess. The algorithm stores and then reuses chains or sequences of moves, built up from previous searches. These move sequences have a built-in forward-pruning mechanism that can radically reduce the search space. A typical search process might retrieve a move from a Transposition Table, where the decision of what mo...
متن کامل*-Minimax Performance in Backgammon
This paper presents the first performance results for Ballard’s *-Minimax algorithms applied to a real–world domain: backgammon. It is shown that with effective move ordering and probing the Star2 algorithm considerably outperforms Expectimax. Star2 allows strong backgammon programs to conduct depth 5 full-width searches (up from 3) under tournament conditions on regular hardware without using ...
متن کامل